|
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. Integer programming is NP-hard. A special case, 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems. ==Canonical and standard form for ILPs== An integer linear program in canonical form is expressed as: :, and an ILP in standard form is expressed as : where the entries of are vectors and is a matrix, having integer values. Note that similar to linear programs, ILPs not in standard form can be converted to standard form by eliminating inequalities by introducing slack variables () and replacing variables that are not sign-constrained with the difference of two sign-constrained variables 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「integer programming」の詳細全文を読む スポンサード リンク
|